A Presentation of the Prerequisite Topics and a Module for a Quantum Encryption (QE) Topic in an IS Course

I present a variant of the quantum encryption (QE) algorithm and an elementary outline of the quantum mechanics (QM) axioms and math results that make it work. There are two points in the algorithm where QM plays a role. One is a quote of a deep theorem that makes acceptable sense in light of the outline of axioms. The second is only an application of vector representations in a basis. Another topic appears throughout: discrete probability. Using this insight, I present an outline of a prerequisite topic review module for an IS course introducing QE. Available by email from me are a Java console application interactive QE Simulator, and extensive slide sets on background material at various levels of difficulty. This discussion assumes some familiarity with the very basics of cryptography (one-time-pads, sending in the clear, symmetric keys etc.).